[INFO] cloning repository https://github.com/zhristophe/leetcode-rs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/zhristophe/leetcode-rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fzhristophe%2Fleetcode-rs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fzhristophe%2Fleetcode-rs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 57abfb79ce722981388779f5e9e0b4ddf3df76b9
[INFO] checking zhristophe/leetcode-rs against try#a2a6e871b05c7b8ecc9a3c8a20db1f39e995e399 for pr-145770
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fzhristophe%2Fleetcode-rs" "/workspace/builds/worker-0-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/zhristophe/leetcode-rs
[INFO] finished tweaking git repo https://github.com/zhristophe/leetcode-rs
[INFO] tweaked toml for git repo https://github.com/zhristophe/leetcode-rs written to /workspace/builds/worker-0-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/zhristophe/leetcode-rs on toolchain a2a6e871b05c7b8ecc9a3c8a20db1f39e995e399
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+a2a6e871b05c7b8ecc9a3c8a20db1f39e995e399" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/zhristophe/leetcode-rs already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+a2a6e871b05c7b8ecc9a3c8a20db1f39e995e399" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+a2a6e871b05c7b8ecc9a3c8a20db1f39e995e399" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] c30c11fbee6f308c510172bef562c06017e89bd0b91dc20d4f9559026ee1fcef
[INFO] running `Command { std: "docker" "start" "-a" "c30c11fbee6f308c510172bef562c06017e89bd0b91dc20d4f9559026ee1fcef", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "c30c11fbee6f308c510172bef562c06017e89bd0b91dc20d4f9559026ee1fcef", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "c30c11fbee6f308c510172bef562c06017e89bd0b91dc20d4f9559026ee1fcef", kill_on_drop: false }`
[INFO] [stdout] c30c11fbee6f308c510172bef562c06017e89bd0b91dc20d4f9559026ee1fcef
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+a2a6e871b05c7b8ecc9a3c8a20db1f39e995e399" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 4ac42e18c575de7bc678aabe3e5c1e9a00af117352e9451a443194a0327e05e8
[INFO] running `Command { std: "docker" "start" "-a" "4ac42e18c575de7bc678aabe3e5c1e9a00af117352e9451a443194a0327e05e8", kill_on_drop: false }`
[INFO] [stderr]     Checking leetcode-rs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused variable: `is_infected`
[INFO] [stdout]   --> src/bin/749_contain-virus.rs:14:26
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn contain_virus(is_infected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |                          ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_is_infected`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/749_contain-virus.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contain_virus` is never used
[INFO] [stdout]   --> src/bin/749_contain-virus.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn contain_virus(is_infected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:13:24
[INFO] [stdout]    |
[INFO] [stdout] 13 | use std::collections::{HashMap, VecDeque};
[INFO] [stdout]    |                        ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:52
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |                                                    ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edges`
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:60
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |                                                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_critical_and_pseudo_critical_edges` is never used
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `ans`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:88:17
[INFO] [stdout]    |
[INFO] [stdout] 88 |         let mut ans = vec![0; n as usize];
[INFO] [stdout]    |                 ^^^ help: if this is intentional, prefix it with an underscore: `_ans`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:89:13
[INFO] [stdout]    |
[INFO] [stdout] 89 |         for i in 0..n {}
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:88:13
[INFO] [stdout]    |
[INFO] [stdout] 88 |         let mut ans = vec![0; n as usize];
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_edge_reversals` is never used
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn min_edge_reversals(n: i32, edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:16:13
[INFO] [stdout]    |
[INFO] [stdout] 16 |         let n = values.len();
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `f`
[INFO] [stdout]   --> src/bin/174_dungeon-game.rs:17:13
[INFO] [stdout]    |
[INFO] [stdout] 17 |         let f = vec![vec![0; n]; m];
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_f`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/174_dungeon-game.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `calculate_minimum_hp` is never used
[INFO] [stdout]   --> src/bin/174_dungeon-game.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn calculate_minimum_hp(dungeon: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_score_triangulation` is never used
[INFO] [stdout]   --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn min_score_triangulation(values: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums1`
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:38
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |                                      ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums2`
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:55
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |                                                       ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums1`
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:38
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |                                      ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums2`
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:55
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |                                                       ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/4_median-of-two-sorted-arrays.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_median_sorted_arrays` is never used
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/4_median-of-two-sorted-arrays.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_median_sorted_arrays` is never used
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `f`
[INFO] [stdout]   --> src/bin/174_dungeon-game.rs:17:13
[INFO] [stdout]    |
[INFO] [stdout] 17 |         let f = vec![vec![0; n]; m];
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_f`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/174_dungeon-game.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `calculate_minimum_hp` is never used
[INFO] [stdout]   --> src/bin/174_dungeon-game.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn calculate_minimum_hp(dungeon: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `is_infected`
[INFO] [stdout]   --> src/bin/749_contain-virus.rs:14:26
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn contain_virus(is_infected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |                          ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_is_infected`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/749_contain-virus.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contain_virus` is never used
[INFO] [stdout]   --> src/bin/749_contain-virus.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn contain_virus(is_infected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:13:24
[INFO] [stdout]    |
[INFO] [stdout] 13 | use std::collections::{HashMap, VecDeque};
[INFO] [stdout]    |                        ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `ans`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:88:17
[INFO] [stdout]    |
[INFO] [stdout] 88 |         let mut ans = vec![0; n as usize];
[INFO] [stdout]    |                 ^^^ help: if this is intentional, prefix it with an underscore: `_ans`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:89:13
[INFO] [stdout]    |
[INFO] [stdout] 89 |         for i in 0..n {}
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:88:13
[INFO] [stdout]    |
[INFO] [stdout] 88 |         let mut ans = vec![0; n as usize];
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_edge_reversals` is never used
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn min_edge_reversals(n: i32, edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:52
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |                                                    ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edges`
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:60
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |                                                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_critical_and_pseudo_critical_edges` is never used
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:16:13
[INFO] [stdout]    |
[INFO] [stdout] 16 |         let n = values.len();
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_score_triangulation` is never used
[INFO] [stdout]   --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn min_score_triangulation(values: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 1.01s
[INFO] running `Command { std: "docker" "inspect" "4ac42e18c575de7bc678aabe3e5c1e9a00af117352e9451a443194a0327e05e8", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "4ac42e18c575de7bc678aabe3e5c1e9a00af117352e9451a443194a0327e05e8", kill_on_drop: false }`
[INFO] [stdout] 4ac42e18c575de7bc678aabe3e5c1e9a00af117352e9451a443194a0327e05e8
